Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. We review (...) the history of previous studies of the similarities and differences in the theories of definability of the first three of these four languages. A seminal role leading toward unification of the theories has been played by the separation principles introduced by Nikolai Luzin in 1927. Emphasizing analogies and driving toward further unification embracing finite-universe logic we concentrate on a simple example—the first and second separation principles for existential-universal first-order sentences . Using this as a test case for the fundamental problem of how to “finitize” arguments in classical pure logic to the finite-universe case, we are led to the analogous negative solution by using the theory of certain special graphs: a graph is - special for any positive integers m , n , p , q iff it is bipartite with m red points and n blue points and for every p -tuple of red points there is a blue point to which they are all connected . As an aside we introduce for further study a natural “Ramseyesque” increasing sequence A of positive integers, where A is the least positive integer n for which an -special graph exists. (shrink)

Is logic normative for reasoning? In the wake of work by Gilbert Harman and John MacFarlane, this question has been reduced to: are there any adequate bridge principles which link logical facts to normative constraints on reasoning? Hitherto, defenders of the normativity of logic have exclusively focussed on identifying adequate validity bridge principles: principles linking validity facts—facts of the form 'gamma entails phi'—to normative constraints on reasoning. This paper argues for two claims. First, for the time being at least, Harman’s (...) challenge cannot be surmounted by articulating validity bridge principles. Second, Harman’s challenge can be met by articulating invalidity bridge principles: principles linking invalidity facts of the form 'gamma does not entail phi' to normative constraints on reasoning. In doing so, I provide a novel defence of the normativity of logic. (shrink)